Language Constructs for Data Partitioning and Distribution
نویسندگان
چکیده
منابع مشابه
Dynamic Assessment: From Underlying Constructs to Implications for Language Teaching
Testing as a general trait of social life has received a great deal of attention by many language teachers and scholars. Throughout history, people have been tested to prove their abilities and experiences or to confirm their capacities. Many authorities have said that assessment and instruction should be integrated as a single and inseparable activity which seeks to understand development by a...
متن کاملmodeling loss data by phase-type distribution
بیمه گران همیشه بابت خسارات بیمه نامه های تحت پوشش خود نگران بوده و روش هایی را جستجو می کنند که بتوانند داده های خسارات گذشته را با هدف اتخاذ یک تصمیم بهینه مدل بندی نمایند. در این پژوهش توزیع های فیزتایپ در مدل بندی داده های خسارات معرفی شده که شامل استنباط آماری مربوطه و استفاده از الگوریتم em در برآورد پارامترهای توزیع است. در پایان امکان استفاده از این توزیع در مدل بندی داده های گروه بندی ...
Transactional Language Constructs for C + +
Authors: Hans Boehm, HP, [email protected] Justin Gottschlich, Intel, [email protected] Victor Luchangco, Oracle, [email protected] Maged Michael, IBM, [email protected] Mark Moir, Oracle, [email protected] Clark Nelson, Intel, [email protected] Torvald Riegel, Red Hat, [email protected] Tatiana Shpeisman, Intel, [email protected] Michael Wong, IBM,...
متن کاملLanguage Constructs for Modular Parallel
We describe programming language constructs that facilitate the application of modular design techniques in parallel programming. These constructs allow us to isolate resource management and processor scheduling decisions from the speciication of individual modules, which can themselves encapsulate design decisions concerned with concurrency, communication, process mapping, and data distributio...
متن کاملAdaptive Data Partitioning Using Probability Distribution
Many computing problems benefit from dynamic data partitioning—dividing a large amount of data into smaller chunks with better locality. When data can be sorted, two methods are commonly used in partitioning. The first selects pivots, which enable balanced partitioning but cause a large overhead of up to half of the sorting time. The second method uses simple functions, which is fast but requir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1995
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1995/656010